Schedule Optimization based on Coloured Petri Nets and Local Search
نویسنده
چکیده
The contribution deals with simulation-optimization of schedules that are modelled by simple Coloured Petri nets (CPNs). CPN modelling of standard classes of scheduling problems is addressed and compact CPN representations of scheduling problems are proposed. It is shown how a combination of CPN representations with predefined transition sequence conflict resolution strategy can be used to optimize schedules by standard local search optimization algorithms. Possible neighbourhood construction procedures for various problem classes are proposed with the emphasis on solutions feasibility.
منابع مشابه
Availability evaluation of Software architecture of object oriented Style using coloured Petri nets
Software architecture is one of the most fundamental products in the process of software development in the areas of behavioral or non- behavioral features like availability or transformability change. There are different ways to evaluate software architecture one of which is the creation of application model. An executable model of software architecture is an official description of architectu...
متن کاملApplication of CPN Tools for Simulation and Analysis of Bandwidth Allocation
We consider the problem of bandwidth allocation in a substrate network as an optimization problem for the aggregate utility of multiple applications with diverse requirements and describe a simulation scheme for dynamically adaptive bandwidth allocation protocols. The proposed simulation model based on Coloured Petri Nets (CPN) is realized using CPN Tools. Keywords—Bandwidth Allocation Problem,...
متن کاملAn urban traffic network model via coloured timed Petri nets
This paper deals with modelling of traffic networks for control purposes. A modular framework based on coloured timed Petri nets is proposed to model the dynamics of signalized traffic network systems: places represent link cells and crossing sections, tokens are vehicles and token colours represent the routing of the corresponding vehicle. In addition, ordinary timed Petri nets model the signa...
متن کاملAdaptive job-shop scheduling with routing and sequencing flexibility using expert knowledge and coloured Petri nets
Petri Nets are known to be efficient for modeling manufacturing systems, because they have a graphical representation and a well-defined semantics allowing formal analysis. Considering conflicts as routingand sequencing alternatives, we propose a knowledge based algorithm for on-line scheduling, that guides the search for a near optimal schedule in the state space efficiently and limits the sta...
متن کاملCapacity Planning for Vertical Search Engines: An Approach Based on Coloured Petri Nets
This paper proposes a Colored Petri Net model capturing the behaviour of vertical search engines. In such systems a query submitted by a user goes through different stages and can be handled by three different kinds of nodes. The proposed model has a modular design that enables accommodation of alternative/additional search engine components. A performance evaluation study is presented to illus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012